Audio fingerprint extraction by scaling in time and resampling

ABSTRACT

An audio fingerprint is extracted from an audio sample, where the fingerprint contains information that is characteristic of the content in the sample. The fingerprint may be generated by computing an energy spectrum for the audio sample, resampling the energy spectrum, transforming the resampled energy spectrum to produce a series of feature vectors, and computing the fingerprint using differential coding of the feature vectors. The generated fingerprint can be compared to a set of reference fingerprints in a database to identify the original audio content.

BACKGROUND

1. Field of the Invention

The present invention relates generally to audio signal processing, and more particularly to extracting characteristic fingerprints from audio signals and to searching a database of such fingerprints.

2. Background of the Invention

Because of the variations in file formats, compression technologies, and other methods of representing data, the problem of identifying a data signal or comparing it to others raises significant technical difficulties. For example, in the case of digital music files on a computer, there are many formats for encoding and compressing the songs. In addition, the songs are often sampled into digital form at different data rates and have different characteristics (e.g., different waveforms). Recorded analog audio also contains noise and distortions. These significant waveform differences make direct comparison of such files a poor choice for efficient file or signal recognition or comparison. Direct file comparison also does not allow comparison of media encoded in different formats (e.g., comparing the same song encoded in MP3 and WAV).

For these reasons, identifying and tracking media and other content, such as that distributed over the Internet, is often done by attaching metadata, watermarks, or some other code that contains identification information for the media. But this attached information is often incomplete, incorrect, or both. For example, metadata is rarely complete, and filenames are even more rarely uniform. In addition, approaches such as watermarking are invasive, altering the original file with the added data or code. Another drawback of these approaches is that they are vulnerable to tampering. Even if every media file were to include accurate identification data such as metadata or a watermark, the files could be “unlocked” (and thus pirated) if the information were successfully removed.

To avoid these problems, other methods have been developed based on the concept of analyzing the content of a data signal itself. In one class of methods, an audio fingerprint is generated for a segment of audio, where the fingerprint contains characteristic information about the audio that can be used to identify the original audio. In one example, an audio fingerprint comprises a digital sequence that identifies a fragment of audio. The process of generating an audio fingerprint is often based on acoustical and perceptual properties of the audio for which the fingerprint is being generated. Audio fingerprints typically have a much smaller size than the original audio content and thus may be used as a convenient tool to identify, compare, and search for audio content. Audio fingerprinting can be used in a wide variety of applications, including broadcast monitoring, audio content organization, filtering of content of P2P networks, and identification of songs or other audio content. As applied to these various areas, audio fingerprinting typically involves fingerprint extraction as well as fingerprint database searching algorithms.

Most existing fingerprinting techniques are based on extracting audio features from an audio sample in the frequency domain. The audio is first segmented into frames, and for every frame a set of features is computed. Among the audio features that can be used are Fast Fourier Transform (FFT) coefficients, Mel Frequency Cepstral Coefficients (MFCC), spectral flatness, sharpness, entropy, and modulation frequency. The computed features are assembled into a feature vector, which is usually transformed using derivatives, means, or variances. The feature vector is mapped into a more compact representation using algorithms such as Principal Component Analysis, followed by quantization, to produce the audio fingerprint. Usually, a fingerprint obtained by processing a single audio frame has a relatively small size and may not be sufficiently unique to identify the original audio sequence with the desired degree of reliability. To enhance fingerprint uniqueness and thus increase the probability of correct recognition (and decrease false positive rate), small sub fingerprints can be combined into larger blocks representing about three to five seconds of audio.

One fingerprinting technique, developed by Philips, uses a short-time Fourier Transform (STFT) to extract a 32-bit sub-fingerprint for every interval of 11.8 milliseconds of an audio signal. The audio signal is first segmented into overlapping frames 0.37 seconds long, and the frames are weighed by a Hamming window with an overlap factor of 31/32 and transformed into the frequency domain using a FFT. The frequency domain data obtained may be presented as a spectrogram (e.g., a time-frequency diagram), with time on the horizontal axis and frequency on the vertical axis. The spectrum of every frame (spectrogram column) is segmented into 33 non-overlapping frequency bands in the range of 300 Hz to 2000 Hz, with logarithmic spacing. The spectral energy in every band is calculated, and a 32-bit sub-fingerprint is generated using the sign of the energy difference in consecutive bands along the time and frequency axes. If the energy difference between two bands in one frame is larger than energy difference between the same bands in the previous frame, the algorithm outputs “1” for the corresponding bit in the sub-fingerprint; otherwise, it outputs “0” for the corresponding bit. A fingerprint is assembled by combining 256 subsequent 32-bit sub-fingerprints into single fingerprint block, which corresponds to three seconds of audio.

Although designed to be robust against common types of audio processing, noise, and distortions, this algorithm is not very robust against large speed changes because of the resulting spectrum scaling. Accordingly, a modified algorithm was proposed in which audio fingerprints are extracted in the scale-invariant Fourier-Mellin domain. The modified algorithm includes additional steps performed after transforming the audio frames into the frequency domain. These additional steps include spectrum log-mapping followed by a second Fourier transform. For every frame, therefore, a first FFT is applied, the result is log-mapped to obtain a power spectrum, and a second FFT is applied. This can be described as the Fourier transform of the logarithmically resampled Fourier transform, and it is similar to well known MFCC methods widely used in speech recognition. The main difference is that Fourier-Mellin transform uses log-mapping of whole spectrum, while MFCC is based on the mel-frequency scale (linear up to 1 kHz and has log spacing for higher frequencies, mimicking the properties of the human auditory system).

The Philips algorithm falls into a category of so-called short-term analysis algorithms because the sub-fingerprints are calculated using spectral coefficients of just two consecutive frames. There are other algorithms that extract spectral features using multiple overlapped FFT frames in the spectrogram. Some of the methods based on evaluation of multiple frames in time are known as long-term spectrogram analysis algorithms.

One long-term analysis algorithm, described for example in Sukittanon, “Modulation-Scale Analysis for Content Identification,” IEEE Transactions on Signal Processing, vol. 52, no. 10 (October 2004), is based on the estimation of modulation frequencies. In this algorithm, the audio is segmented and a spectrogram is computed for it. A modulation spectrum is then calculated for each spectrogram band (e.g., a range of frequencies in the spectrogram) by applying a second transform along the temporal row (e.g., the horizontal axis) of the spectrogram. This is different from the modified Philips approach, in which the second FFT is applied along the frequency column of the spectrogram (e.g., the vertical axis). In this approach, the spectrogram is segmented into N frequency bands, and the same number N of continuous wavelet transforms (CWT) are calculated, one for each band.

Although the developers of this algorithm claim superior performance compared to the Philips algorithm, existing algorithms still exhibit a number of deficiencies. For example, the algorithms may not be sufficiently robust to identify distorted speech and music reliably, especially when the audio is compressed using a CELP audio codec (e.g., associated with cell phone audio, such as GSM). Moreover, these algorithms are generally sensitive to noise and analog distortions, such as those associated with a microphone recording. And even if the algorithms can identify audio in presence of single type of distortion, they may not be able to handle a combination of multiple distortions, which is more common and closer to a real world scenario (e.g., as with a cell phone, audio recorded from a microphone in a noisy room with light reverberation followed by GSM compression).

When applied to practical applications, therefore, existing fingerprinting schemes have unacceptably high error rates (e.g., false positives and false negatives), produce fingerprints that are too large to be commercially viable, and/or are too slow. Accordingly, there exists a need to overcome existing limitations that current audio recognition techniques have failed to solve.

SUMMARY OF THE INVENTION

Accordingly, the present invention enables a characteristic fingerprint to be extracted from an audio signal based on the content of that signal. This fingerprint can be matched against a set of reference fingerprints (e.g., in a database) to determine the identity of the signal or the similarity between two signals. Because of the nature of the fingerprint extraction algorithm, it does not suffer from many of the problems that plague existing solutions, and as compared to such solutions it is fast, efficient, highly accurate, scalable, and robust.

In an embodiment of a method for generating an audio fingerprint, an audio signal is sampled and spectrogram information is computed from the signal. The spectrogram is divided into a plurality of frequency bands. Sequences samples in the bands are resampled.

In one embodiment, resampling the sequence samples comprises logarithmically mapping the samples. In another embodiment, resampling the sequence samples comprises scaling in time the size of the sequence samples based on a mid-frequency and/or frequency range of the corresponding frequency band and resampling the scaled sequence samples. In another embodiment, resampling the sequence samples comprises offsetting in time the sequence samples based on a mid-frequency and/or frequency range of the corresponding frequency band and resampling the offset sequence samples. In another embodiment, resampling the sequence samples comprises sampling from different sequence samples (i.e., frequency bands) as time changes.

A second transform is then applied to the resample sequences to obtain a feature vector for each sequence. In one embodiment, the second transform comprises a transform along the time axis. In another embodiment, the second transform comprises a transform along the time axis followed by a transform across the frequency axis. In another embodiment, the second transform comprises a Two Dimensional Discrete Cosine Transform (2D DCT). The audio fingerprint is computed based on the feature vectors. The audio fingerprint may be stored on a computer readable medium or may be fixed momentarily as a transmissible signal.

The different types of resampling of the sequence samples described make the algorithm less sensitive to variations in audio playback speed and time compression and stretching. In this way, the fingerprint of an audio signal should have little or no variation regardless of variations in its playback speed or due to time compression or stretching. The resampling described also improves the low frequency resolution of the second time-frequency transform. This allows the use of a simple transform instead of complex wavelet transforms used for analysis of the spectrogram modulation spectrum, making the implementation more efficient and faster compared to previous methods.

Moreover, because of the resampling described, the band output frame contains, for the most part, samples that represent the beginning of the analyzed audio sequence. The resulting fingerprint is thus generated using samples primarily located at the beginning of the sequence. Since a relatively small part of the audio sequence makes the most contribution in the resulting fingerprint, the fingerprint may be used to match shorter audio sequences. In one implementation, for example, a fingerprint generated from a five-second original audio frame can be reliably matched to samples taken from audio fragments that are twice as short.

Embodiments of the fingerprinting techniques are also tolerant to noise and signal distortions. One implementation can detect speech-like signals in the presence of 100% of white noise (i.e., a signal to noise ratio of 0 db). The techniques are also tolerant to filtering, compression, frequency equalization, and phase distortions.

In another embodiment, where the generated fingerprint frame is formed using a specified number of frequency bands, an acoustic model is used to mark insignificant frequency bands. Insignificant bands may include bands that do not add substantially any perceptible value in distinguishing the audio sample. Processing only relevant frequency bands increases the signal to noise ratio and improves robustness of the overall fingerprint matching process. Moreover, excluding irrelevant frequency bands can greatly improve the recognition efficiency of band-limited audio content, for example in case of speech encoded at very low bit rate or analog recordings with slow tape speed.

Embodiments of the invention also provide for fast indexing and efficient searching for fingerprints in a large-scale database. For example, an index for each audio fingerprint may be computed from a portion of the fingerprint's contents. In one embodiment, a set of bits from a fingerprint is used as the fingerprint's index, where the bits correspond to the more stable low frequency coefficients due to the resampling. To match a test fingerprint with a set of fingerprints in a database, the test fingerprint may be matched against the indexes to obtain a group of candidate fingerprints. The test fingerprint is then matched against the candidate fingerprints, thereby avoiding the need to match the test fingerprint against every fingerprint in the database.

In another embodiment, an edge detection algorithm is used to determine the exact edges of an analyzed audio frame or fragment. In some applications, especially when audio samples differ only during short time periods of the overall samples, knowing the location of the edge of the analyzed audio frame within the audio sample is important. The edge detection algorithm may use linear regression techniques to identify the edge of an audio frame.

Applications of embodiments of the fingerprinting technology are numerous, and they include the real-time identification of audio streams and other audio content (e.g., streaming media, radio, advertisements, Internet broadcasts, songs in CDs, MP3 files, or any other type of audio content). Embodiments of the invention thus enable efficient, real-time media content auditing and other reporting.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic drawing of a process for extracting and using a fingerprint from an audio sample, in accordance with an embodiment of the invention.

FIG. 2 is a schematic diagram of a fingerprint extraction system, in accordance with an embodiment of the invention.

FIG. 3 is a flow diagram of a matching algorithm, in accordance with an embodiment of the invention.

FIG. 4 illustrates an edge detection algorithm, in accordance with an embodiment of the invention.

FIG. 5 is a schematic diagram of a fingerprint extraction system including logarithmic resamplers and T-point Transform modules, in accordance with an embodiment of the invention.

FIGS. 6A and 6B illustrate a graphical representation of a fingerprint extraction algorithm, in accordance with several alternative embodiments of the invention.

FIGS. 7A and 7B illustrate graphical representations of band-pass filters applied to an audio frame, in accordance with an embodiment of the invention.

FIGS. 8A-8C illustrate graphical representations of resampling sub-band sample sequences, in accordance with several alternative embodiments of the invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Overview

Embodiments of the invention enable the extraction of characteristic information (e.g., an audio fingerprint) from a sample of audio as well as the matching or identification of the audio using that extracted characteristic information. As illustrated in FIG. 1, a frame 105 of audio taken from an audio sample 100 is input into a fingerprint extraction algorithm 110. The audio sample 100 may be provided by any of a wide variety of sources. Using the sequence of audio frames 105, the fingerprint extraction algorithm 110 generates one or more audio fingerprints 115 that are characteristic of the sequence. Serving as a distinguishing identifier, the audio fingerprint 115 provides information relating to the identity or other characteristics of the sequence of frames 105 of the audio sample 100. In particular, one or more fingerprints 115 for the audio sample 100 may allow the audio sample 100 to be uniquely identified. Embodiments of the fingerprint extraction algorithm 110 are described in more detail below.

Once generated, the extracted fingerprint 115 can then be used in a further process or stored on a medium for later use. For example, the fingerprint 115 can be used by a fingerprint matching algorithm 120, which compares the fingerprint 115 with entries in a fingerprint database 125 (e.g., a collection of audio fingerprints from known sources) to determine the identity of the audio sample 100. Various methods for using the fingerprints are also described below.

The audio sample 100 may originate from any of a wide variety of sources, depending on the application of the fingerprinting system. In one embodiment, the audio sample 100 is sampled from a broadcast received from a media broadcaster and digitized. Alternatively, a media broadcaster may transmit the audio in digital form, obviating the need to digitize it. Types of media broadcasters include, but are not limited to, radio transmitters, satellite transmitters, and cable operators. The fingerprinting system can thus be used to audit these broadcasters to determine what audio are broadcast at what times. This enables an automated system for ensuring compliance with broadcasting restrictions, licensing agreements, and the like. Because the fingerprint extraction algorithm 110 may operate without having to know the precise beginning and ending of the broadcast signals, it can operate without the cooperation or knowledge of the media broadcaster to ensure independent and unbiased results.

In another embodiment, a media server retrieves audio files from a media library and transmits a digital broadcast over a network (e.g., the Internet) for use by the fingerprint extraction algorithm 110. A streaming Internet radio broadcast is one example of this type of architecture, where media, advertisements, and other content is delivered to an individual or to a group of users. In such an embodiment, the fingerprint extraction algorithm 110 and the matching algorithm 120 usually do not have any information regarding the beginning or ending times of individual media items contained within the streaming content of the audio sample 100; however, these algorithms 110 and 120 do not need this information to identify the streaming content.

In another embodiment, the fingerprint extraction algorithm 110 receives the audio sample 100, or a series of frames 105 thereof, from a client computer that has access to a storage device containing audio files. The client computer retrieves an individual audio file from the storage and sends the file to the fingerprint extraction algorithm 110 for generating one or more fingerprints 115 from the file. Alternatively, the client computer may retrieve a batch of files from storage 140 and sends them sequentially to the fingerprint extractor 110 for generating a set of fingerprints for each file. (As used herein, “set” is understood to include any number of items in a grouping, including a single item.) The fingerprint extraction algorithm 110 may be performed by the client computer or by a remote server coupled to the client computer over a network.

Algorithm

One embodiment of a fingerprint extraction system 200 that implements the fingerprint extraction algorithm 110 shown in FIG. 1 is illustrated in FIG. 2. The fingerprint extraction system 200 comprises an analysis filterbank 205, which is coupled to a plurality of processing channels (each including one or more processing modules, labeled here as elements 210 and 215), which are in turn coupled to a differential encoder 225 for producing an audio fingerprint 115. The fingerprint extraction system 200 is configured to receive an audio frame 105, for which an audio fingerprint is to be generated.

Described in more detail below, for every input audio frame 105 the analysis filterbank 205 generally computes power spectrum information for a received signal across a range of frequencies. In one embodiment, each processing channel corresponds to a frequency band within that range of frequencies, which bands may overlap. Accordingly, the channels divide the processing performed by the fingerprint extraction system 200 so that each channel performs the processing for a corresponding band. In another embodiment, each processing channel processes multiple frequency bands (i.e., multiple frequency bands are associated with each processing channel). In other embodiments, the processing for the plurality of bands may be performed in a single channel by a single module, or the processing may be divided in any other configuration as appropriate for the application and technical limitations of the system.

The analysis filterbank 205 receives an audio frame 105 (such as the frame 105 from the audio sample 100 illustrated in FIG. 1). The analysis filterbank 205 converts the audio frame 105 from the time domain into the frequency domain to compute power spectrum information for the frame 105 over a range of frequencies. In one embodiment, the power spectrum for the signal in a range of about 250 to 2250 Hz is split into a number of frequency bands (e.g., Y bands, where Y=13). The bands may have a linear or a logarithmic mid-frequency distribution (or any other scale) and also may overlap. The output of the filterbank contains a measure of the energy of the signal for each of a plurality of bands. In one embodiment, the measure of the average energy is taken using the cubic root of the average spectral energy in the band.

Various implementations of the analysis filterbank 205 are possible, depending on the software and hardware requirements and limitations of the system. In one embodiment, the analysis filterbank 205 comprises a number of band-pass filters that isolate the signal of the audio frame 105 for each of the frequency bands followed by energy estimation and down sampling. In one embodiment, the frequencies passed by each band-pass filter vary with time. In another embodiment, the frequencies passed by each band-pass filter are constant (i.e., do not vary with time). FIG. 7A illustrates a graphical representation of the embodiment where the frequencies passed by each band-pass filter do not vary with time. Each rectangle in graph 702 represents a signal of the audio frame 105 output by a band-pass filter. FIG. 7B on the other hand, illustrates a graphical representation of the embodiment where the frequencies passed by each band-pass filter vary with time. As can be seen in graph 704, in this example, the frequencies passed by each band-pass filter decrease with time. In other embodiments, the frequencies passed increase with time. After the band-pass filters are applied to the audio frame 105, each frequency band includes the signals output by its corresponding band-pass filter.

In another embodiment, the analysis filterbank 205 is implemented using a short-time Fast Fourier Transform (FFT). For example, the audio 100 sampled at 8 kHz is segmented into 64-ms frames 105 (i.e., 512 samples). The power spectrum of each 50% overlapped segment consisting of two audio frames 105 (i.e. 1024 samples) is then calculated by Han windowing and performing an FFT, followed by band filtering using M evenly or logarithmically spaced overlapped triangle windows.

A variety of time-frequency domain transforms may be used instead of the FFT described above. For example, a Modified Discrete Cosine Transform (MDCT) may be used. One advantage of the MDCT is its low complexity, as is may be computed using only one n/4 point FFT and some pre- and post-rotation of the samples. Accordingly, a filterbank 205 implemented with MDCT is expected to perform better than one implemented with a FFT, e.g., able to calculate transforms twice as fast.

In another embodiment, the analysis filterbank 205 is implemented using the MP3 hybrid filterbank, which includes a cascading polyphase filter and a MDCT followed by aliasing cancellation. The MP3 filterbank produces 576 spectral coefficients for every frame 105 of audio consisting of 576 samples. For audio sampled at 8 kHz, the resulting frame rate is 13.8 fps compared to 15.626 fps of a 1024-point FFT filterbank described above. The frame rate difference is set off during the time-frequency analysis when the data are resampled, as discussed below. The analysis filterbank 205 may also be implemented using a Quadrature Mirror Filter (QMF). The first stage of MP3 hybrid filterbank employs a QMF filter with 32 equal-width bands. Accordingly, the 250 to 2250-Hz frequency range of an 11,025-Hz audio signal may thus be divided into 13 bands.

One advantage of the MP3 filterbank is its portability. There are highly optimized implementations of MP3 filterbanks for different CPUs. Accordingly, the fingerprint generation routine can be easily integrated with the MP3 encoder, which may obtain spectral coefficients from the MP3 filterbank without additional processing. Accordingly, the fingerprint generation routine can be easily integrated with the MP3 decoder, which may obtain spectral data directly from a MP3 bit stream without its complete decoding. Integration with other audio codecs is also possible.

Once it is determined, the sub-band samples are buffered and provided to one or more resamplers 210. The resamplers 210 receive the sub-band samples and resample the sub-samples to produce resample sequences. In one embodiment, the resamplers 210 resample the sub-band samples according to a non-uniform order, such as non-sequential or an order reverse to the order in which the samples were sampled.

In one embodiment, each resampler 210 corresponds to one of the Y frequency bands and receives for the corresponding frequency band a sequence of S samples linearly spaced in time (e.g., where S is selected to be from 64 to 80, depending on the filterbank's implementation). In one embodiment, when the sub-band sample sequences are received, each resampler performs logarithmic resampling, scale resampling or offset resampling on its respective sub-band sample sequence. As a result of the resampling, the resamplers 210 produce M resample sequences for each audio frame.

In one embodiment, logarithmic resampling comprises a resampler 210 logarithmically mapping its corresponding sub-band samples to produce a resample sequence with T samples (e.g., where T=64) logarithmically spaced in time. Instead of logarithmic sampling other types of nonlinear sampling may be performed, such as exponential resampling.

In one embodiment, offset resampling comprises a resampler 210 offsetting (i.e., shifting) in time its respective sub-band sample sequence. The offset of the sub-band sequence is based on the mid-frequency and/or frequency range of the resampler's frequency band. For example, it may be that the higher the sub-band mid-frequency the bigger the time offset of the sub-band sample sequence. The offset sub-band sample sequence is resampled by the resampler 210 to produce a resample sequence with T samples.

In one embodiment, offset resampling comprises a resampler 210 offsetting (i.e., shifting) in time its respective sub-band sample sequence. The offset of the sub-band sequence is based on the mid-frequency and/or frequency range of the resampler's frequency band. For example, it may be that the higher the sub-band mid-frequency the bigger the time offset of the sub-band sample sequence. The offset sub-band sample sequence is resampled by the resampler 210 to produce a resample sequence with T samples

In another embodiment, each resampler 210 corresponds to multiple frequency bands. Each resampler 210 receives the sub-band sample sequence of multiple frequency bands. The number of sub-band sample sequences received by each resampler 210 varies based on the implementation. In one embodiment, the frequency bands corresponding to each resampler are consecutive.

Each resampler 210 performs time-frequency resampling on its corresponding sub-band sequences. Time-frequency resampling comprises a resampler 210 sampling from different corresponding frequency bands as time changes to produce a resample sequence with T samples. In one embodiment, as time increases, the frequencies from which the resampler 210 samples decreases. In another embodiment, as time increases, the frequencies from which the resampler 210 samples also increases. As a result of the resampling, the resamplers 210 produce M resample sequences for each audio frame.

FIGS. 8A and 8B illustrate time-frequency resampling according to one embodiment. In FIG. 8A, each gray outlined rectangle of graph 802 represents a different frequency band (i.e., the sample sequence of a frequency band). Each diagonal black line represents a resample sequence produced by a resampler 210 as a result of time-frequency resampling. As seen in graph 802, to produce a resample sequence, each resampler 210 samples different corresponding frequency bands as time changes. In the embodiment of graph 802, the frequencies from which the resamplers 210 sample decreases as time increases. Graph 804 of FIG. 8B is an illustration of the resample sequences of FIG. 8A without the frequency bands.

Graph 806 of FIG. 8C illustrates resample sequences produced by the resamplers 210 in the embodiment where each resampler 210 corresponds to one of the Y frequency bands. Similar to FIG. 8A, each gray outlined rectangle of graph 806 represents a different frequency band and each black line in the middle of a rectangle represents a resample sequence. As can be seen in FIG. 8C, the number of resample sequences produced by the resampler 210 in this embodiment is the same as the number of frequency bands (i.e., M=Y). This is the case because each resampler 210 samples within its frequency band.

However, as can be seen in FIG. 8A, in the embodiment where each resampler 210 corresponds to multiple frequency bands and performs time-frequency resampling, the number of resample sequences is less than the number of frequency bands (i.e., M<Y). More frequency bands are needed in this embodiment to ensure that each resampler 210 obtains samples from within the same time period and that each resample sequence includes T samples.

After the resampling is performed by the resamplers 210 and M resample sequences have been produced, the resample sequences can be stored in a [M×T] matrix, which corresponds to a sampled spectrogram having a time (horizontal) axis and a frequency (vertical) axis. The M resample sequences are provided to one or more transform modules 215, which perform a transform on the samples.

In one embodiment, the transform performed on the samples for each band is a T-point transform, which is a transform along the time axis (e.g., each row of the [M×T] matrix). In one embodiment, the T-point transform is a T-point FFT. The resulting series of coefficients from the FFT is called a feature vector. In one embodiment, the feature vector for each band comprises every other coefficient of the FFT computed for that band in order of ascending frequency. Accordingly, each feature vector would include N coefficients (e.g., where N=T/2=32). In another embodiment, instead of performing a T-point FFT, a T-point Discrete Cosine Transform (DCT), T-point Discrete Hartley Transform (DHT), or Discrete Wavelet Transofrm (DWT) is performed. The resulting feature vectors are provided to a differential encoder 225

In another embodiment, the transform performed is a T-point transform followed by an M-point transform. A T-point transform is performed on the samples for each band as described above. After the T-point transform, the samples for each band are scaled in magnitude, windowed, and normalized. Following the scaling, windowing, and normalization, a M-point transform is performed on the samples, which is a transform along the frequency axis (e.g., each column of the [M×T] matrix). In one embodiment, the M-point transform is a FFT, DCT, DHT or DWT along the frequency axis. The resulting feature vectors are provided to the differential encoder 225.

In another embodiment, the transform is a Two Dimensional Discrete Cosine Transform (2D DCT). To perform the transform, the samples for each band are normalized. Once the samples are normalized a one dimensional DCT is performed along the time axis. The one dimensional DCT along the time axis is followed by a one dimensional DCT along the frequency axis. The resulting feature vectors are provided to the differential encoder 225.

The differential encoder 225 generates a fingerprint 115 for the audio sample. In one embodiment, the differential encoder 225 subtracts the feature vectors corresponding to each pair of adjacent bands. If there are Y bands, there are Y−1 pairs of adjacent bands. Subtracting two feature vectors gives a vector of N difference values. For each of these difference values, the differential encoder 225 selects a 1 if the difference is greater than or equal to 0, and the differential encoder 225 selects a 0 if the difference is less than 0. For each group of four bits in the sequence, the encoder assigns a bit value according to a codebook table. The best codebook values are calculated during tuning and training of the fingerprinting algorithm. Repeating this process for the feature vectors of each of the consecutive pairs of bands results in a [(Y−1).times.N/4] matrix of bits. This matrix, which can be represented as a linear bit sequence, is used as the audio fingerprint 115. In the example where Y=13 and N=8, the fingerprint 115 has 12 bytes of information.

In one embodiment, the Principal Component Analysis (PCA) is used to de-correlate and reduce size of the obtained feature vector before it is quantized. Other de-correlation techniques, such the Digital Cosine Transform, may be used in addition or alternatively to eliminate redundancy and compact the feature vector.

In one embodiment, the fingerprint extraction system 200 generates a plurality of fingerprints for a highly overlapped series of audio frames in a particular audio signal. In one example, each series of frames 105 processed by the system 200 contains three seconds of the audio signal and starts 64 milliseconds after a previous series starts. In this way, a fingerprint is generated for a number of three-second portions of the audio signal that begin every 64 milliseconds. To implement such a scheme, the fingerprint extraction system 200 may include memory buffers before and after the analysis filterbank 205, where the buffers are updated with the next 64 milliseconds of the audio signal as the next audio frame 105 is received.

FIGS. 6A and 6B illustrate a graphical representation of the fingerprint extraction algorithm 110, in accordance with several alternative embodiments of the invention. In this process, the analysis filterbank 205 receives an audio frame. Graph 602 is a representation of the received audio frame in the time domain. The analysis filter bank 205 performs an FFT on the audio frame to convert it from the time domain to the frequency domain, shown in graph 604. Power spectrum information is then calculated for the frame when it is in the frequency domain. The analysis filter bank 205 applies a number of band-pass filters to isolate the signal of the frame for each frequency band, illustrated in graph 606.

The sub-band sample sequences of the frequency bands are resampled by the resamplers 210. FIG. 6B shows four alternative techniques (labeled A, B, C, and D) that may be performed by the resamplers 210 to resample the sub-band sample sequences. In one embodiment, techniques A, B, and C are techniques that may be performed when each resampler 210 corresponds to one frequency band. In one embodiment, technique D may be performed when each resampler 210 corresponds to multiple frequency bands and the resamplers 210 are configured to perform time-frequency resampling.

In technique A, each resampler 210 logarithmically samples its corresponding sub-band sample sequence (graph 608) to produce a resample sequence with T samples (graph 616). In technique B, each resampler 210 scales the size of its respective sub-band sample sequence based on the mid-frequency and/or frequency range of the sub-band. As shown in graph 610, in this example, the higher the sub-band mid-frequency and the wider the frequency range of the sub-band, the smaller the size of the sub-band sample sequence. The scaled sub-band sample sequences are resampled to produce resample sequences, each with T samples (graph 618).

In technique C, each resampler 210 offsets in time its respective sub-band sample sequence based on the mid-frequency and/or frequency range of the sub-band. As shown in graph 612, in this example, the higher the sub-band mid frequency, the bigger the offset of the sub-band sample sequence. The offset sub-band sample sequences are resampled to produce resample sequences, each with T samples (graph 620).

In technique D, each resampler 210 performs time-frequency resampling on its corresponding sub-band sample sequences. Time-frequency resampling is performed by a resampler 210 sampling from different corresponding frequency bands as time changes. As shown in graph 614, in this example as time increases, the frequencies from which the resamplers 210 sample decreases. The resampling produces resample sequences, each with T samples (graph 622).

The resample sequences produced by the resamplers 210 (M resample sequences) are stored in a [M×T] matrix. Each transform module 215 performs a transform on the resample sequence produced by its corresponding resampler 210 (i.e., resampler 210 in the same channel as transform module 215). FIG. 6 illustrates three alternative techniques (labeled E, F, and G) that may be performed by the transform module 215 to transform the resample sequence and generate a feature vector.

In technique E, the transform module 215 performs a T-point transform, as illustrated in graph 624. In Technique F, the transform module 215 performs a T-point transform in one dimension, followed by an M-point transform in the other dimension, as illustrated in graph 626. In technique G, the transform module 215 performs a two-dimensional DCT, or other suitable two-dimensional transform, as illustrated in graph 628.

Once the sub-band samples have been transformed to obtain feature vectors, the differential encoder 225 uses the feature vectors generated by the transform modules 215 to generate a fingerprint 115.

FIG. 5 is an example of a fingerprint extraction system 200 where the resamplers 210 are logarithmic resamplers 210 and the transform modules 215 are T-point transform modules 215. The logarithmic resamplers 210 perform logarithmic sampling as described above (technique A). However, it should be understood that in other embodiments the logarithmic resamplers 210 may be interchanged for resamplers 210 that perform other resampling techniques (i.e., technique B, C, or D).

The T-point transform modules 215 perform a T-point transform as described above (technique E). However, in other embodiments the T-point transform module 215 may be interchanged for transform modules 215 that perform other transform techniques (i.e., technique F or G).

Acoustic Model

In various applications of the fingerprinting system, certain frequency bands may be insignificant because they are imperceptible, because an encoding process for the audio sample removed the bands, or for some other reason. In one embodiment, therefore, an acoustic model 235 is used to identify and mark the insignificant frequency bands for a particular fingerprint. Acoustic models, such as the psychoacoustic model, are well known in various audio processing fields. A set of model parameters for the acoustic model 235 can be calculated for high quality reference samples during the creation of a fingerprint 115 and stored in the database 125. The insignificant bands in the fingerprint 115 can be marked by assigning a special code or zeroing out their corresponding values (i.e., bits). This effectively causes the bands to be ignored in any subsequent matching process, since in the process of matching of a fingerprint with the database records, only pairs of correspondent bands that have non-zero values are used to distinguish the fingerprint 115. Masked bands (i.e., those having zero values) may also be excluded from comparison altogether.

In one embodiment, the acoustic model is a psychoacoustic model for the human auditory system. This may be useful where the purpose of the fingerprinting system is the identification of audio targeted human auditory system. Such audio may be compressed by one or more perceptual encoders removing irrelevant audio information. The use of the human psycho acoustic model allows identifying and excluding such irrelevant bands from the fingerprints.

But the psychoacoustic model is just one type of an acoustic model that is suited to human perceptual encoded audio. Another acoustic model is a model that mimics the properties of a specific recording device. Each band for such a recording device acoustic model may have a weight factor assigned to it depending on its importance. Yet another acoustic model mimics the properties of specific environments, such as background noise found in a vehicle or room. In such an embodiment, each band for the acoustic model may have a weight factor assigned to it depending on its importance in the environment for which the system is designed.

In one embodiment, parameters of the acoustic model 235 and filterbank 205 depend on the type and properties of the analyzed audio signal 100. Different profiles comprising a set of subband weight factors and a number of filterbank bands and their frequency distributions are used to obtain a better match of the properties of the targeted audio signal. For speech-like audio, for example, the power of the signal is mainly concentrated in low frequency bands, while music might contain higher frequency relevant components depending on genre. In one embodiment, the parameters of the acoustic model are calculated from the reference audio signal and stored in content database together with generated fingerprints. In another embodiment, the parameters of the acoustic model are calculated dynamically based on properties of analyzed audio signal during the matching process.

Accordingly, possible applications of the acoustic model 235 include tuning the audio recognition parameters for specific environment and/or recording device and encoding algorithm properties. For example, knowing acoustical properties of the cell phone audio path (microphone characteristics, audio processing and compression algorithms, and the like) allows the development of an acoustic model that mimics these properties. Using this model during fingerprint comparison may significantly increase robustness of the matching process of the generated fingerprints.

Fingerprint Indexing and Matching

In one embodiment, a fingerprint indexer 230 generates an index for each fingerprint 115. The fingerprints 115 are then stored in the fingerprint database 125, allowing for efficient searching and matching of the contents of the fingerprint database 125. In an embodiment, the index for a fingerprint 115 comprises a portion or a hash of the fingerprint 115. Accordingly, the fingerprints 115 in the fingerprint database 125 are indexed according to useful identifying information about them.

In an embodiment described above in which each fingerprint 115 comprises a [(Y−1)×N/4] matrix of bits, the indexer 230 uses the bits from the leftmost columns as the index. In the example where each fingerprint 115 is a 12 by 8 matrix of bits, the index for the fingerprint 115 may be the leftmost two columns of bits (24 bits total). In this way, the bits used as the index for each fingerprint 115 are a subset of the fingerprint 115 that are based on the low frequency spectral coefficients of the feature vectors used to compute the fingerprint 115. These bits thus correspond to the low frequency components of the resampled and transformed spectrogram bands, which are stable and insensitive to moderate noise and distortions. With a high level of probability, therefore, similar fingerprints would have the same numerical value of the index. In this way, the index may be used to label and group similar and likely matching fingerprints in database.

FIG. 3 illustrates a method of matching a test fingerprint to the fingerprint database 125 using the indexes described above, in accordance with one embodiment of the invention. To find a match in the fingerprint database 125 for a test fingerprint, the matching algorithm begins by computing 310 an index value for the test fingerprint as described above. Using this index value, a group of candidate fingerprints is obtained 320, for example, where the group includes all of the fingerprints in the database 125 that have the same index value. As explained above, it is highly likely that any matches in the database 125 are in this group of candidate fingerprints because of the way the index value is computed.

To test for any matches in the group of candidate fingerprints, a bit error rate (BER) between the test fingerprint and each candidate fingerprint is computed 330. The BER between two fingerprints is the percentage of their corresponding bits that do not match. For unrelated completely random fingerprints, the BER would be expected to be 50%. In one embodiment, two fingerprints are matching where the BER is less than about 35%; however, other numerical limits may be used depending on the desired tolerance for false positives and/or false negatives. In addition, calculations or criteria other than BER can be used to compare two fingerprints. For example, the inverse measure of BER, the match rate may be also used. Moreover, certain bits may be weighted more highly than others in the comparison of two fingerprints.

If 340 there are no matches within the predetermined matching criteria, or if 350 there are no more indexes to modify, the matching algorithm has failed to find any matches of the test fingerprint in the database 125. The system may then continue to search (e.g., using less restrictive criteria in obtaining the candidate fingerprints) or may stop. If 340 there are one or more matching fingerprints, a list of the matching fingerprints is returned 360.

In one embodiment, the system may repeat the search as described above after modifying 370 the calculated fingerprint index in order to obtain a different set of candidate fingerprints from which to search for a match. To modify 370 the calculated fingerprint index, one or multiple bits of the calculated fingerprint index may be flipped. In one example where the fingerprint index has 24 bits, after failing to find a match using the original fingerprint index, the search step is repeated 24 times with a different single bit of the 24-bit fingerprint index flipped each time. Various other techniques can be used to enlarge the search space.

In one embodiment, the fingerprint indexer 230 generates one or more indexes by selecting index bits from one or more fingerprints based on a set of frequency band weight factors calculated by the acoustic model 235 and previously stored in the database 125. When multiple indexes are used, including indices obtained by bit flipping, the group of candidate fingerprints includes all candidates obtained for every calculated index.

In another embodiment, the area of search may be narrowed by prescreening and selecting only fingerprint candidates found in most or all candidate groups obtained for each calculated index. Prescreening of the multiple fingerprint candidates groups by using multiple indices, including indices obtained by bit flipping, may significantly improve the performance of the database search. In one embodiment, indexes and references to possible fingerprint candidates are stored in computer memory allowing fast selection and prescreening of the fingerprint candidates. On the second step (step 320), only fingerprint candidates that have the highest probability to match given fingerprint are loaded into computer memory and compared. This approach allows fast search by keeping only small indices in computer memory, while storing larger fingerprints on slow devices (e.g., a hard drive or over a network).

Detecting Edges of an Audio Frame

In some applications, it may be desirable to detect the edges of a matching audio fragment. Edge detection allows the system to know precisely where a particular matching audio fragment occurs in time. Depending on the quality of the analyzed audio, embodiments of the edge detection algorithm may be able to detect the edges of a matching audio fragment with about 0.1 to 0.5 seconds of precision.

As explained above, embodiments of the fingerprinting technique accumulate audio samples in sub-band processing buffers. Because of this buffering, the output of the fingerprinting algorithm is delayed and smeared on audio fragment edges. This effect is illustrated in FIG. 4, which is a graph of the bit error rate (BER) over time between reference fingerprints for an audio fragment and a series of fingerprints generated over time for an incoming sample audio stream. In the embodiment illustrated, the sub-band buffers hold three seconds of audio, and a match is declared when two fingerprints have a bit error rate (BER) of 35% or less.

Initially, at time T0, the sub-band processing buffers are empty, and the generated fingerprint thus produces zero matches with the original audio (i.e., the BER is expected to be approximately equal to 50%). As audio samples are added to the sub-band buffers the BER decreases, indicating a better match. After sufficient time passes, the BER decreases below the threshold 35% at time T1, indicating a match. Finally, at time T2, the BER reaches a plateau as the buffers are filled by samples. When the fingerprinting algorithm passes the end of the correspondent audio fragment, at time T3, it begins to produce fingerprints that match less and thus have an increasing BER, which reaches the recognition threshold 35% at time T4. The duration of obtained match curve (T1−T4) and the duration of the plateau (T2−T3) are each shorter than the duration of the matched audio fragment (T0−T3).

In one embodiment, an edge detection algorithm is used to determine the exact edges of a matching audio frame or fragment. A BER curve such as illustrated in FIG. 4 is obtained. The BER curve is segmented into regions, which correspond to the beginning of match with decreasing BER (e.g., T1−T2), the plateau with approximately constant BER (e.g., T2−T3), and the end of match with increasing BER (e.g., T3−T4). Because a real BER curve will generally be noisy, it is segmented using an appropriate technique such as a regression analysis. In one embodiment, all samples that produce BER above 35% are ignored because they may not be reliable. The beginning of the matching audio fragment (i.e., time T1) may then be calculated using linear regression as the crossing of a line that fits in the best way a decreasing BER region (e.g., T1−T2) with a horizontal line that corresponds to 50% BER. A similar approach may be applied to estimate time T5, taking the intersection of a line that fits in the best way an increasing BER region (e.g., T3−T4) and a horizontal line that corresponds to 50% BER. In this case, however, time T5 corresponds to the end of the fragment delayed by the duration B of the sub-band buffer, not the actual end of the matching audio fragment. The location of the end of the fragment (i.e., time T3) can be calculated by subtracting the sub-band buffer duration B from the obtained estimate T5.

In another embodiment, the end of the matching audio fragment is estimated as the end of the region T2−T3, and the beginning of the audio fragment is calculated by subtracting the duration of the sub-band buffer B from time T2, which corresponds to the beginning of the region T2−T3.

Summary

Although discussed in terms of vectors and matrices, the information computed for any fingerprint or sub-fingerprint may be stored and processed in any form, not just as a vector or matrix of values. The terms vector and matrix are thus used only as a convenient mechanism to express the data extracted from an audio sample and is not meant to be limiting in any other way. In addition, although the power spectrum is discussed in terms of a spectrogram, it is understood that the data representing the power spectrum or spectral analysis of an audio signal may be represented and used not only as a spectrogram, but in any other suitable form.

In one embodiment, a software module is implemented with a computer program product comprising a computer-readable medium containing computer program code, which can be executed by a computer processor for performing any or all of the steps, operations, or processes described herein. Accordingly, any of the steps, operations, or processes described herein can be performed or implemented with one or more software modules or hardware modules, alone or in combination with other devices. Moreover, any portions of the system described in terms of hardware elements may be implemented in software, and any portions of the system described in terms of software elements may be implemented in hardware, such as hard-coded into a dedicated circuit. For example, code for performing the methods described can be embedded in a hardware device, for example in an ASIC or other custom circuitry. This allows the benefits of the invention to be combined with the capabilities of many different devices.

In another embodiment, the fingerprinting algorithm is embedded in and run on any of a variety of audio devices, such as a cellular phone, a personal digital assistant (PDA), a MP3 player and/or recorder, a set-top box, a television set, a game console or any other device that stores, processes or plays audio content. Embedding the fingerprinting algorithm on such a device may have a number of benefits. For example, generating audio fingerprints directly on a cellular phone would provide better results compared to sending compressed audio from the phone to a fingerprinting server over cell network. Running the algorithm on the cellular phone eliminates distortions caused by GSM compression, which was designed to compress speech and performs poorly on music. Accordingly, this approach may significantly improve the recognition of audio recorded by a cellular phone. It also reduces the load on servers as well as network traffic.

Another benefit of such an embedded approach is the ability to monitor listening experience without violation of privacy and user rights. For example, a recording device may record audio, create fingerprints, and then send only fingerprints to a server for analysis. The recorded audio never leaves the device. The server may then identify targeted music or advertisements using the sent fingerprints, even though it would be impossible to recover the original audio from the fingerprints.

The foregoing description of the embodiments of the invention has been presented for the purpose of illustration; it is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Persons skilled in the relevant art can appreciate that many modifications and variations are possible in light of the above teachings. It is therefore intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto. 

What is claimed is:
 1. A method for extracting an audio fingerprint from an audio frame, the method comprising: filtering, by a processor, the audio frame into a plurality of frequency bands by varying the frequency bands with time to produce a corresponding plurality of filtered audio signals; scaling in time, by the processor, for fingerprinting, a size of each filtered audio signal based on a frequency of the corresponding frequency band, the scaling based on at least one of a mid-frequency and a frequency range of the corresponding frequency band; resampling, by the processor, the scaled filtered audio signals by sampling from different corresponding frequency bands as time changes to produce resampled audio signals; transforming, by the processor, the resampled audio signals to produce a feature vector for each resampled audio signal; and computing, by the processor, the audio fingerprint based on the feature vectors.
 2. The method of claim 1, wherein transforming a resampled audio signal comprises performing a transform along a time axis.
 3. The method of claim 1, wherein transforming a resampled audio signal comprises: transforming the resampled audio signal along a time axis; and transforming the resampled audio signal along a frequency axis.
 4. The method of claim 3, further comprising, by the processor, scaling in magnitude, windowing, and normalizing the resampled audio signal.
 5. The method of claim 1, wherein transforming a resampled audio signal comprises performing a Two Dimensional Discrete Cosine Transform (2D DCT).
 6. A computing device, comprising: a processor; a storage medium for tangibly storing thereon program logic for execution by the processor, the program logic comprising: filtering logic executed by the processor for filtering an audio frame into a plurality of frequency bands by varying the frequency bands with time to produce a corresponding plurality of filtered audio signals; scaling logic executed by the processor for scaling in time, for fingerprinting, a size of each filtered audio signal based on a frequency of the corresponding frequency band, the scaling based on at least one of a mid-frequency and a frequency range of the corresponding frequency band; resampling logic executed by the processor for resampling the scaled filtered audio signals by sampling from different corresponding frequency bands as time changes to produce resampled audio signals; transforming logic executed by the processor for transforming the resampled audio signals to produce a feature vector for each resampled audio signal; and computing logic executed by the processor for computing an audio fingerprint based on the feature vectors.
 7. The computing device of claim 6, wherein the transforming logic for transforming a resampled audio signal comprises performing logic for performing a transform along a time axis.
 8. The computing device of claim 6, wherein the transforming logic for transforming a resampled audio signal comprises: second transforming logic for transforming the resampled audio signal along a time axis; and third transforming logic for transforming the resampled audio signal along a frequency axis.
 9. The computing device of claim 8, further comprising second scaling logic executed by the processor for scaling in magnitude, windowing, and normalizing the resampled audio signal.
 10. The computing device of claim 6, wherein the transforming logic for transforming a resampled audio signal comprises performing logic for performing a Two Dimensional Discrete Cosine Transform (2D DCT).
 11. A non-transitory computer readable storage medium for tangibly storing computer program instructions capable of being executed by a computer processor, the computer program instructions defining the steps of: filtering, by the computer processor, an audio frame into a plurality of frequency bands by varying the frequency bands with time to produce a corresponding plurality of filtered audio signals; scaling, by the computer processor, in time, for fingerprinting, a size of each filtered audio signal based on a frequency of the corresponding frequency band, the scaling based on at least one of a mid-frequency and a frequency range of the corresponding frequency band; resampling, by the computer processor, the scaled filtered audio signals by sampling from different corresponding frequency bands as time changes to produce resampled audio signals; transforming, by the computer processor, the resampled audio signals to produce a feature vector for each resampled audio signal; and computing, by the computer processor, an audio fingerprint based on the feature vectors.
 12. The non-transitory computer readable storage medium of claim 11, wherein transforming a resampled audio signal comprises performing a transform along a time axis.
 13. The non-transitory computer readable storage medium of claim 11, wherein transforming a resampled audio signal comprises: transforming the resampled audio signal along a time axis; and transforming the resampled audio signal along a frequency axis.
 14. The non-transitory computer readable storage medium of claim 13, further comprising, by the computer processor, scaling in magnitude, windowing, and normalizing the resampled audio signal.
 15. The non-transitory computer readable storage medium of claim 11, wherein transforming a resampled audio signal comprises performing, by the computer processor, a Two Dimensional Discrete Cosine Transform (2D DCT). 